Convex polygon

Results: 120



#Item
21CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  On the worst-case complexity of the silhouette of a polytope Helmut Alt  ∗

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the worst-case complexity of the silhouette of a polytope Helmut Alt ∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:29
22CCCG 2010, Winnipeg MB, August 9–11, 2010  Hausdorff Core of a One Reflex Vertex Polygon Robert Fraser∗  Abstract

CCCG 2010, Winnipeg MB, August 9–11, 2010 Hausdorff Core of a One Reflex Vertex Polygon Robert Fraser∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:18
23CCCG 2006, Kingston, Ontario, August 14–16, 2006  Tight Bounds for Point Recolouring Yurai N´ un ˜ez and David Rappaport

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Tight Bounds for Point Recolouring Yurai N´ un ˜ez and David Rappaport

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:57:44
24CCCG 2006, Kingston, Ontario, August 14–16, 2006  Computing the Tool Path of an Externally Monotone Polygon in Linear Time∗ Prosenjit Bose†  1

CCCG 2006, Kingston, Ontario, August 14–16, 2006 Computing the Tool Path of an Externally Monotone Polygon in Linear Time∗ Prosenjit Bose† 1

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:58:07
25CCCG 2011, Toronto ON, August 10–12, 2011  On k-Gons and k-Holes in Point Sets Oswin Aichholzer∗ Marco A. Heredia

CCCG 2011, Toronto ON, August 10–12, 2011 On k-Gons and k-Holes in Point Sets Oswin Aichholzer∗ Marco A. Heredia

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
26CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003  An Algorithm for the MaxMin Area Triangulation of a Convex Polygon J. Mark Keil, Tzvetalin S. Vassilev Department of Computer Science University of Saskatchewan, 57

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 An Algorithm for the MaxMin Area Triangulation of a Convex Polygon J. Mark Keil, Tzvetalin S. Vassilev Department of Computer Science University of Saskatchewan, 57

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:30
27The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon∗ Gill Barequet† Yuval Scharf †

The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon∗ Gill Barequet† Yuval Scharf †

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:54
28CCCG 2009, Vancouver, BC, August 17–19, 2009  Open Problems from CCCG 2008 Erik D. Demaine∗  The following is a list of the problems presented on

CCCG 2009, Vancouver, BC, August 17–19, 2009 Open Problems from CCCG 2008 Erik D. Demaine∗ The following is a list of the problems presented on

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:31:48
2916th Canadian Conference on Computational Geometry, 2004  ˝ A remark on the Erdos–Szekeres theorem Adrian Dumitrescu

16th Canadian Conference on Computational Geometry, 2004 ˝ A remark on the Erdos–Szekeres theorem Adrian Dumitrescu

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
30Improved Upper Bounds on the Reflexivity of Point Sets Eyal Ackerman∗ Oswin Aichholzer†  Abstract

Improved Upper Bounds on the Reflexivity of Point Sets Eyal Ackerman∗ Oswin Aichholzer† Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:29:49